A Size Condition for Diameter Two Orientable Graphs
نویسندگان
چکیده
منابع مشابه
Diameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملGenus distributions of orientable embeddings for two types of graphs
Abstract On the basis of the joint tree model introduced by Liu in 2003, the genus distributions of the orientable embeddings for further types of graphs can be obtained. These are apparently not easily obtained using overlap matrices, the formula of Jackson, etc. In this paper, however, by classifying the associated surfaces, we calculate the genus distributions of the orientable embeddings fo...
متن کاملCyclically Orientable Graphs
Barot, Geiss and Zelevinsky define a notion of a “cyclically orientable graph” and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky’s work leaves open the question of giving an efficient characterization of cyclically orientable graphs. In this paper, we give a simple recursive description of cyclically orientable graphs, and use this to give ...
متن کاملOn cyclically orientable graphs
Graph G is called cyclically orientable (CO) if it admits an orientation in which every simple chordless cycle is cyclically oriented. This family of graphs was introduced by Barot, Geiss, and Zelevinsky in their paper “Cluster algebras of finite type and positive symmetrizable matrices”, J. London Math. Soc. 73 Part 3 (2006), 545-564. The authors obtained several nice characterizations of CO-g...
متن کاملOrientable Strong Radius and Diameter of Hypercube
For two vertices u, v in a strong digraph D, the strong distance sd(u, v) between u and v is the minimum size of a strong subdigraph of D containing u and v. The upper (lower) orientable strong radius SRAD(G) of a graph G is the maximum (minimum) strong radius over all strong orientations of G. The upper (lower) orientable strong diameter SDIAM(G) of a graph G is the maximum (minimum) strong di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2021
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-020-02261-x